Fixed-Point Arithmetic Line Clipping
نویسندگان
چکیده
This algorithm supports line clipping against a rectangular window with edges parallel to the screen. The algorithm combines different partial solutions given in the bibliography such as implicit area codes, decision trees, line ends comparison, symmetry or avoiding redundant calculations, mixing them with fixed-point arithmetic, explicit calculation reusing and dynamic monitoring. It may work in the fractional object space while still using integer arithmetic (fixed-point). It is faster than traditional algorithms. It provides more precision without using floating point arithmetic.
منابع مشابه
The Effects of Quantization on Multi-Layer Feedforward Neural Networks
In this paper we investigate the combined effect of quantization and clipping on multilayer feedforward neural networks (MLFNN). Statistical models are used to analyze the effects of quantization in a digital implementation. We analyze the performance degradation caused as a function of the number of fixed-point and floating-point quantization bits in the MLFNN. To analyze a true nonlinear neur...
متن کاملBresenham's Line Generation Algorithm with Built-in Clipping
One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham’s line generation algorithm to include...
متن کاملUnivalent holomorphic functions with fixed finitely many coefficients involving Salagean operator
By using generalized Salagean differential operator a newclass of univalent holomorphic functions with fixed finitely manycoefficients is defined. Coefficient estimates, extreme points,arithmetic mean, and weighted mean properties are investigated.
متن کاملSome Fixed Point Results in Menger Spaces Using a Control Function
Here we prove a probabilistic contraction mapping principle in Menger spaces. This is in line with research in fixed point theory using control functions which was initiated by Khan et al. [Bull. Austral. Math. Soc., 30(1984), 1-9] in metric spaces and extended by Choudhury et al. [Acta Mathematica Sinica, 24(8) (2008), 1379-1386] in probabilistic metric spaces. An example has also been constru...
متن کاملParallel Fixed-Point Digital Differential Analyser with Antialiasing. PFDDAA
This paper introduces a quick, efficient and simple algorithm for drawing straight lines with antialiasing on discrete devices like printers or CRTs. It is based on the DDA algorithm. It uses 32 bits fixed-point arithmetic. This is a pipelined, parallelized and scalable SIMD version. It may be hardware implemented. It is suitable for MMX or Streaming SIMD Pentium1 III instructions. The algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003